Symmetry Breaking via LexLeader Feasibility Checkers
نویسندگان
چکیده
This paper considers matrix models, a class of CSPs which generally exhibit significant symmetries. It proposed the idea of LexLeader feasibility checkers that verify, during search, whether the current partial assignment can be extended into a canonical solution. The feasibility checkers are based on a novel result by [Katsirelos et al., 2010] on how to check efficiently whether a solution is canonical. The paper generalizes this result to partial assignments, various variable orderings, and value symmetries. Empirical results on 5 standard benchmarks shows that feasibility checkers may bring significant performance gains, when jointly used with DOUBLELEX or SNAKELEX.
منابع مشابه
Symmetry Breaking with Polynomial Delay
A conservative class of constraint satisfaction problems (csps) is a class for which membership is preserved under arbitrary domain reductions. Many well-known tractable classes of csps are conservative. It is well known that lexleader constraints may significantly reduce the number of solutions by excluding symmetric solutions of csps. We show that adding certain lexleader constraints to any i...
متن کاملStatic Symmetry Breaking with the Reflex Ordering
LexLeader, a state of the art static symmetry breaking method, adds a lex ordering constraint for each variable symmetry of the problem to select the lexicographically least solution. In practice, the same method can also be used for partial symmetry breaking by breaking only a given subset of symmetries. We propose a new total ordering, reflex, as basis of a new symmetry breaking constraint th...
متن کاملArities of Symmetry Breaking Constraints
Static symmetry breaking is a well-established technique to speed up the solving process of symmetric Constraint Satisfaction Programs (csps). Static symmetry breaking suffers from two inherent problems: symmetry breaking constraints come in great numbers and are of high arity. Here, we consider the problem of high arity. We prove that not even for binary csps can we always reduce the arity of ...
متن کاملExpressing Symmetry Breaking in DRAT Proofs
An effective SAT preprocessing technique is using symmetrybreaking predicates, i.e., auxiliary clauses that guide a solver away from needless exploration of isomorphic sub-problems. Although symmetrybreaking predicates have been in use for over a decade, it was not known how to express them in proofs of unsatisfiability. Consequently, results obtained by symmetry breaking cannot be validated by...
متن کاملDynamic Symmetry Breaking Restarted
Recently, structural symmetry breaking (SSB), a new technique for breaking all piecewise variable and value symmetry in constraint satisfaction problems (CSPs), was introduced. As of today, it is unclear whether the heavy symmetry filtering that SSB performs is at all worthwhile. This paper has two aims: First, we assess the feasibility of SSB. To this end, we introduce the first random benchma...
متن کامل